package leetcode.editor.cn;

/**
 * @author: yangwk
 * @date: 2023/6/6
 * @description:
 **/
public class P198 {
    /**
     * You are a professional robber planning to rob houses along a street.
     * Each house has a certain amount of money stashed, the only constraint stopping you
     * from robbing each of them is that adjacent houses have security systems connected and
     * it will automatically contact the police if two adjacent houses were broken into on the
     * same night.
     * Given an integer array nums representing the amount of money of each house, return the
     * maximum amount of money you can rob tonight without alerting the police.
     */
    public static void main(String[] args) {
        System.out.println(rob(new int[]{1, 2}));
    }


    public static int rob(int[] nums) {
        if (nums.length == 0) {
            return 0;
        }
        if (nums.length == 1) {
            return nums[0];
        }
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        return dp[nums.length - 1];
    }
}
